Asymptotic maximal deviation of M-smoothers
نویسندگان
چکیده
منابع مشابه
Deviation of Neutrino Mixing from Bi-maximal
We have studied how observables of the neutrino mixing matrix can link up with the ones in the quark sector. The deviation from the bi-maximal flavor mixing is parameterized using a 3 × 3 unitary matrix. The neutrino mixings are investigated supposing this unitary matrix to be hierarchical like the quark mixing matrix. We obtain the remarkable prediction |Ue3| ≥ 0.03 from the experimentally all...
متن کاملM-Smoothers in Testing and Estimating
In this paper a new method for estimating of an unknown regression function, based on local M-smoothers estimators is proposed, where the final estimate will be robust in both, regressor resp. response variable. This method can be viewed as a combination of classical local linear kernel estimates and robust Mestimates. This method arises as a straightforward generalization of local constant M-s...
متن کاملRemarks on M-type Smoothers with Edge Preserving Properties
(1998) have formulated an important and practical problem: How to smooth the noise out of image data while at the same time preserving unsmooth features such as jumps, spikes and edges? They formalize the problem as the estimation of a mostly smooth regression function function, m(x), based on observations Y i that decompose as follows: By assuming m satisses standard nonparametric smoothness a...
متن کاملProbing the deviation from maximal mixing of atmospheric neutrinos
Pioneering atmospheric muon neutrino experiments have demonstrated the near-maximal magnitude of the flavor mixing angle θ23. But the precise value of the deviation D ≡ 1/2 − sin θ23 from maximality (if nonzero) needs to be known, being of great interest – especially to builders of neutrino mass and mixing models. We quantitatively investigate in a three generation framework the feasibility of ...
متن کاملMaximal covering location-allocation problem with M/M/k queuing system and side constraints
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 1989
ISSN: 0047-259X
DOI: 10.1016/0047-259x(89)90022-5